Ela Structure Preserving Algorithms for Perplectic
نویسنده
چکیده
Structured real canonical forms for matrices in Rn×n that are symmetric or skewsymmetric about the anti-diagonal as well as the main diagonal are presented, and Jacobi algorithms for solving the complete eigenproblem for three of these four classes of matrices are developed. Based on the direct solution of 4 × 4 subproblems constructed via quaternions, the algorithms calculate structured orthogonal bases for the invariant subspaces of the associated matrix. In addition to preserving structure, these methods are inherently parallelizable, numerically stable, and show asymptotic quadratic convergence.
منابع مشابه
Structure Preserving Algorithms for Perplectic Eigenproblems∗
Structured real canonical forms for matrices in Rn×n that are symmetric or skew-symmetric about the anti-diagonal as well as the main diagonal are presented, and Jacobi algorithms for solving the complete eigenproblem for three of these four classes of matrices are developed. Based on the direct solution of 4× 4 subproblems constructed via quaternions, the algorithms calculate structured orthog...
متن کاملEla Structured Qr Algorithms for Hamiltonian Symmetric Matrices
Efficient, backward-stable, doubly structure-preserving algorithms for the Hamiltonian symmetric and skew-symmetric eigenvalue problems are developed. Numerical experiments confirm the theoretical properties of the algorithms. Also developed are doubly structure-preserving Lanczos processes for Hamiltonian symmetric and skew-symmetric matrices.
متن کاملEla Structure of the Group Preserving a Bilinear Form∗
The group of linear automorphisms preserving an arbitrary bilinear form is studied.
متن کاملElastic Localization: Improvements on Distributed, Range Free Localization for Wireless Sensor Networks
Numerous wireless sensor network algorithms assume that individual sensors possess location information. However, state of the art localization algorithms often achieve acceptable performance only under restrictive assumptions. For instance, some algorithms necessitate regular sensor deployment or centralized computations. Other algorithms require a high proportion of position aware nodes or th...
متن کاملElastic Localization
Numerous wireless sensor network algorithms assume that individual sensors possess location information. However, state of the art localization algorithms often achieve acceptable performance only under restrictive assumptions. For instance, some algorithms necessitate regular sensor deployment or centralized computations. Other algorithms require a high proportion of position aware nodes or th...
متن کامل